Extremal Optimization
نویسندگان
چکیده
We explore a new general-purpose heuristic for finding high-quality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-organized criticality, a concept introduced to describe emergent complexity in physical systems. Extremal optimization successively replaces extremely undesirable elements of a single sub-optimal solution with new, random ones. Large fluctuations ensue that efficiently explore many local optima. With only one adjustable parameter, its performance has proved competitive with more elaborate methods, especially near phase transitions which are believed to contain the hardest instances. We use extremal optimization to elucidate the phase transition in the 3coloring problem, and we provide independent confirmation of previously reported results for the ground-state energy of ±J spin glasses in d = 3 and 4. PACS number(s): 02.60.Pn, 05.65.+b, 75.10.Nr, 64.60.Cn.
منابع مشابه
On the extremal total irregularity index of n-vertex trees with fixed maximum degree
In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...
متن کاملOptimization with Extremal Dynamics
We explore a new general-purpose heuristic for finding high-quality solutions to hard discrete optimization problems. The method, called extremal optimization, is inspired by self-organized criticality, a concept introduced to describe emergent complexity in physical systems. Extremal optimization successively updates extremely undesirable variables of a single suboptimal solution, assigning th...
متن کاملThe Cross-Entropy Method for Continuous Multi-extremal Optimization
In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with nonlinear constraints.
متن کاملAdapted Extremal Optimization For Materialized Views Selection
With the development of databases in general and data warehouses in particular, it is now of a great importance to reduce the administration tasks of data warehouses. The materialization of views is one of the most important optimization techniques. The construction of a configuration of views optimizing the data warehouse is an NP-hard problem. On the other hand, the algorithm called extremal ...
متن کاملOn Some Interconnections between Combinatorial Optimization and Extremal Graph Theory
The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants u...
متن کاملMulti-objective Optimization with Combination of Particle Swarm and Extremal Optimization for Constrained Engineering Design
Engineering optimization problems usually have several conflicting objectives, such that no single solution can be considered optimum with respect to all objectives. In recent years, many efforts have focused on hybrid metaheuristic approaches for their robustness and efficiency to solve the above-mentioned multiobjective optimization problems (MOPs). This paper proposes a novel hybrid algorith...
متن کامل